Regular handicap tournaments of high degree
نویسندگان
چکیده
منابع مشابه
Regular handicap tournaments of high degree
A handicap distance antimagic labeling of a graph G = (V,E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of the weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xj∈N(xi) f(xj)) forms an increasing arithmetic progression with difference one. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagi...
متن کاملA NOTE ON INCOMPLETE REGULAR TOURNAMENTS WITH HANDICAP TWO OF ORDER n ≡ 8 (mod 16)
A d-handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xixj ∈E f(xj)) forms an increasing arithmetic progression with common difference d. A graph G is a d-handicap distance antimagic graph if it allows a d-handicap distance a...
متن کاملHandicap distance antimagic graphs and incomplete tournaments
Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer μ such that ∑ u∈N(v) f(u) = μ for all v ∈ V, where N(v) is the open neighborhood of v. The constant μ is called the magic constant of the labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. The bijection...
متن کاملHamilton Decompositions of Regular Tournaments
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each η > 0 every regular tournament G of sufficiently large order n contains at least (1/2− η)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tourname...
متن کاملEdge coloring regular graphs of high degree
We discuss the following conjecture: If G = (V; E) is a-regular simple graph with an even number of vertices at most 22 then G is edge colorable. In this paper we show that the conjecture is true for large graphs if jV j < (2 ?)). We discuss related results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2016
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.22530